Approximate Bisimulation Equivalence and Variable Refinement
نویسندگان
چکیده
منابع مشابه
Approximate Bisimulation Equivalence and Variable Refinement
In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow eve...
متن کاملBisimulation and Language Equivalence
One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words). Properties of systems are described in a linear time temporal logic. Relationships between automata, language theory and logic are then utilised, such as the theory of ω-regular languages and Büchi automata. An alternative viewpoint is that an interactive system should b...
متن کاملEpistemic Equivalence and Bisimulation
Bisimulation is an equivalence relation over Kripke models. It is often claimed, but little argued for, that bisimulation captures a ‘natural’ notion of similarity in epistemic semantics, in the sense that the differences between bisimilar models are, from an epistemic point of view, irrelevant. In this paper we examine three types of arguments pertaining to the view that bisimilar models are ‘...
متن کاملStrong Splitting Bisimulation Equivalence
We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...
متن کاملAxiomatising ST-Bisimulation Equivalence
A simple ST operational semantics for a process algebra is provided, by defining a set of operational rules in Plotkin’s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting hierarchical specification of systems. We prove that ST-bisimulation equivalence is a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080454